Refinement and Hierarchical Coarsening Schemes for Triangulated Surfaces
نویسندگان
چکیده
We present a refinement and a coarsening (also simplification or decimation) algorithm for the adaptive representation of bivariate functions. The algorithms have proved to be efficient tools in numerical methods such as finite element method or image processing, [Pla00, Sua01b]. In this paper we particularize the algorithms and apply to the generation of levels of detail of terrain models. The refinement algorithm is very simple and of linear complexity in the number of vertices, and proceeds uniformly or locally in triangular meshes. The coarsening algorithm shows a complexity of O(logn) and obtains an adaptive hierarchical representation of the input terrain. We provide the most important features of the algorithms as well as the application to generate levels of detail of regions in the Gran Canaria island, an island where the topography is of great irregularity. Several experimental data are presented, including times of the meshes generated, rendering times, error evolution, suitability of the meshes and size of the generated meshes. The algorithms have been tested for VRML visualization showing a real time generation of levels of detail, and this fact is showed in the numerical experiments.
منابع مشابه
Using Semi-Regular 4-8 Meshes for Subdivision Surfaces
Semi-regular 4–8 meshes are refinable triangulated quadrangulations. They provide a powerful hierarchical structure for multiresolution applications. In this paper, we show how to decompose the DooSabin and Catmull-Clark subdivision schemes using 4–8 refinement. The proposed technique makes it possible to use these classical subdivision surfaces with semi-regular 4–8 meshes. Additional
متن کاملFour-triangles adaptive algorithms for RTIN terrain meshes
We present a refinement and coarsening algorithm for the adaptive representation of Right-Triangulated Irregular Network (RTIN) meshes. The refinement algorithm is very simple and proceeds uniformly or locally in triangle meshes. The coarsening algorithm decreases mesh complexity by reducing unnecessary data points in the mesh after a given error criterion is applied. We describe the most impor...
متن کاملRobust semi-coarsening multilevel preconditioning of biquadratic FEM systems
While a large amount of papers are dealing with robust multilevel methods and algorithms for linear FEM elliptic systems, the related higher order FEM problems are much less studied. Moreover, we know that the standard hierarchical basis two-level splittings deteriorate for strongly anisotropic problems. A first robust multilevel preconditioner for higher order FEM systems obtained after discre...
متن کاملMultilevel Graph Partitioning Schemes
In this paper we present experiments with a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller graph, and then uncoarsen it to construct a partition for the original graph. We investigate the effectiveness of many different choices for all three phases: coarsening, partition of the coarsest graph, and refinement. In p...
متن کاملMulti-Level hp-Adaptivity: High-Order Mesh Adaptivity without the Difficulties of Constraining Hanging Nodes
hp-refinement schemes have proven to be an excellent approach to locally adapt the accuracy of a Finite Element discretization. However, the implementation of hp-adaptivity remains challenging as hanging nodes, edges, and faces have to be constrained to ensure compatibility of the shape functions. For this reason, most hp-code frameworks restrict themselves to 1-irregular meshes to ease the imp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003